Complementation Constructions for Nondeterministic Automata on Infinite Words
نویسندگان
چکیده
The complementation problem for nondeterministic automata on infinite words has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. Traditional optimal complementation constructions are quite complicated and have not been implemented. Recently, we have developed an analysis techniques for runs of co-Büchi and generalized co-Büchi automata and used the analysis to describe simpler optimal complementation constructions for Büchi and generalized Büchi automata. In this work, we extend the analysis technique to Rabin and Streett automata, and use the analysis to describe novel and simple complementation constructions for them.
منابع مشابه
The Büchi Complementation Saga
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constr...
متن کاملAlternation Elimination for Automata over Nested Words
This paper presents constructions for translating alternating automata into nondeterministic nested-word automata (NWAs). With these alternation-elimination constructions at hand, we straightforwardly obtain translations from various temporal logics over nested words from the literature like CaRet and μNWTL, and extensions thereof to NWAs, which correct, simplify, improve, and generalize the pr...
متن کاملBüchi Complementation: A Forty-Year Saga
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In order to check that the language of an automaton A1 is contained in the language of a second automaton A2, one checks that the intersection of A1 with an automaton that complements A2 is empty. Many problems in verification and design are reduced to language containment. In model ...
متن کاملThe Strength of Safra’s Construction
Automata on Infinite Words. Automata running on infinite words (such as non-deterministic Büchi automata) provide an established framework for the specification and verification of nonterminating programs (in particular via the model checking technique). However, some of their basic properties are known to require non-trivial reasoning principles. This is most notably the case of closure under ...
متن کاملBüchi Complementation Made Tighter
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems is reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constru...
متن کامل